Universal Padding Schemes for RSA

Efficient Universal Padding Schemes for Multiplicative Trapdoor One-way Permutation

From Fixed-Length Messages to Arbitrary-Length Messages Practical RSA Signature Padding Schemes

We show how to construct a practical secure signature padding scheme for arbitrarily long messages from a secure signature padding scheme for fixed-length messages. This new construction is based on a one-way compression function respecting the division intractability assumption. By practical, we mean that our scheme can be instantiated using dedicated compression functions and without chaining...

From Fixed-Length to Arbitrary-Length RSA Padding Schemes

A common practice for signing with RSA is to first apply a hash function or a redundancy function to the message, add some padding and exponentiate the resulting padded message using the decryption exponent. This is the basis of several existing standards. In this paper we show how to build a secure padding scheme for signing arbitrarily long messages with a secure padding scheme for fixed-size...

Parallel Signcryption with OAEP, PSS-R, and other Feistel Paddings

We present a new, elegant composition method for joint signature and encryption, also referred to assigncryption. The new method, which we call Padding-based Parallel Signcryption (PbPS), builds an effi-cient signcryption scheme from any family of trapdoor permutations, such as RSA. Each user U generates asingle public/secret key pair fU/f −1Uused for both sending and receiv...

Padding attacks on RSA

This paper presents a non-technical overview of the the recent attacks against RSA encryption and signature standards. It is intended as both a system design aid and a temporary reference text beginning at a level suitable for engineers, risk managers and system architects with no or little previous exposure to padding attacks. We have used a straightforward approach to the essential consequenc...